A NEW SYSTOLIC ARCHITECTURE FOR FAST DCT COMPUTATION - Circuits and Systems, 1996., ISCAS '96, 'Connecting the World'., 1996 IEEE International Symposium

نویسندگان

  • Tai Chang
  • Chin-Liang Wang
  • Ching-Hsien Chang
چکیده

This paper presents a fast algorithm along with its systolic array implementation for computing the 1-D Npoint discrete cosine transform (DCT), where N is a power of two. The architecture requires log,N multipliers and can evaluate one complete N-point DCT every N clock cycles. It possesses the features of regularity and modularity, and is thus well suited to VLSI implementation. As compared to existing systolic DCT architectures reaching the same throughput performance, the proposed one involves much less hardware complexity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SYSTOLIC ARRAY IMPLEMENTATION OF EUCLID'S ALGORITHM FOR INVERSION AND DIVISION IN GF(2/sup m/) - Circuits and Systems, 1996., ISCAS '96, 'Connecting the World'., 1996 IEEE International Symposium

This paper presents a new systolic VLSI architecture for computing inverses and divisions in finite fields GF(2") based on a variant of Euclid's algorithm. It is highly regular, modular, and thus well suited to VLSI implementation. It has O(m2) area complexity and can produce one result per clock cycle with a latency of 8m-2 clock cycles. As compared to existing related systolic architectures w...

متن کامل

PITCH DETERMINATION AND SPEECH SEGMENTATION USING THE DISCRETE WAVELET TRANSFORM - Circuits and Systems, 1996., ISCAS '96, 'Connecting the World'., 1996 IEEE International Symposium

Pitch determination and speech segmentation are two important parts of speech recognition and speech processing in general. This paper proposes a time-based event detection method for finding the pitch period of a speech signal. Based on the discrete wavelet transform, it detects voiced speech, which is local in frequency, and determines the pitch period. This method is computationally inexpens...

متن کامل

COMPUTING THE GENERIC INDEX OF THE CIRCUIT EQUATIONS OF LINEAR ACTIVE NETWORKS - Circuits and Systems, 1996., ISCAS '96, 'Connecting the World'., 1996 IEEE International Symposium

In many problems, such as the analysis of electrical circuits, one has to deal with Differential-Algebraic Equations (DAE’s). Knowing their generic index is of interest for practical and numerical as well as for theoretical reasons. In this paper we give an algorithm that determines the generic index of the Circuit Equations of linear active electrical networks in polynomial time from tlie netw...

متن کامل

A PARALLEL HIERARCHICAL ALGORITHM FOR MODULE PLACEMENT BASED ON SPARSE LINEAR EQUATIONS - Circuits and Systems, 1996., ISCAS '96, 'Connecting the World'., 1996 IEEE International Symposium

We present a fast and effective module placement algorithm which is based on the PROUD algorithm. The PROUD algorithm uses a hierarchical decomposition technique and the solution of sparse linear systems of equations based on a resistive network analogy. It has been shown that the PROUD algorithm is suitable for solving the placement problem for very large circuits, and obtains placement qualit...

متن کامل

OPTIMUM PRE- AND POSTFILTERS FOR QUANTIZATION - Circuits and Systems, 1996., ISCAS '96, 'Connecting the World'., 1996 IEEE International Symposium

We consider the optimization of preand post filters surrounding a uniform quantizer such that the mean square error due to quantization is minimized. Unlike some previous work, the postfilter is not restricted to be the inverse of the prefilter. With no order constraint on the filters, we present closed form solutions for the optimum preand post filters. Using these optimum solutions, we obtain...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004